A Structural Entropy Measurement Principle of Propositional Formulas in Conjunctive Normal Form

The satisfiability (SAT) problem is a core problem in computer science. Existing studies have shown that most industrial SAT instances can be effectively solved by modern SAT solvers while random SAT instances cannot. It is believed that the structural characteristics of different SAT formula classes are the reasons behind this difference. In this paper, we study the structural properties of propositional formulas in conjunctive normal form (CNF) by the principle of structural entropy of formulas. First, we used structural entropy to measure the complex structure of a formula and found that the difficulty solving the formula is related to the structural entropy of the formula. The smaller the compressing information of a formula, the more difficult it is to solve the formula. Secondly, we proposed a λ-approximation strategy to approximate the structural entropy of large formulas. The experimental results showed that the proposed strategy can effectively approximate the structural entropy of the original formula and that the approximation ratio is more than 92%. Finally, we analyzed the structural properties of a formula in the solution process and found that a local search solver tends to select variables in different communities to perform the next round of searches during a search and that the structural entropy of a variable affects the probability of the variable being flipped. By using these conclusions, we also proposed an initial candidate solution generation strategy for a local search for SAT, and the experimental results showed that this strategy effectively improves the performance of the solvers CCAsat and Sparrow2011 when incorporated into these two solvers.     

Meshless acoustic analysis using a weakly singular Burton-Miller boundary integral formulation

The Burton-Miller boundary integral formulation is solved by a complex variable boundary element-free method (CVBEFM) for the boundary-only meshless analysis of acoustic problems with arbitrary wavenumbers. To regularize both strongly singular and hypersingular integrals and to avoid the computation of the solid angle and its normal derivative, a weakly singular Burton-Miller formulation is derived by considering the normal derivative of the solid angle and adopting the singularity subtraction procedures. To facilitate the implementation of the CVBEFM and the approximation of gradients of the boundary variables, a stabilized complex variable moving least-square approximation is selected in the meshless discretization procedure. The results show the accuracy and efficiency of the present CVBEFM and reveal that the method can produce satisfactory results for all wavenumbers, even for extremely large wavenumbers such as k = 10 000.     

两个DEA的逆问题的解法的探讨

文[1]提出了两个DEA的逆问题，并用搜索法来解．而本文根据所证的定理，对每个问题一般只要解二、三个线性规划问题就能得到答案．     

Heisenberg群上Laplace算子的离散谱

本文证明了Heisenberg群上Laplace算子的Dirichlet特征值的存在性，给出了特征值的估计     

The number of powers of 2 in a representation of large even integers II

It is proved that for any integerk≥ 54 000, there isN _k >0 depending onk only such that every even integer ≥N _k is a sum of two odd prime numbers andk powers of 2. Project partially supported by RGC Research Grant (No.HKU 7122/97P) and Post-Doctoral Fellowship of the University of Hong Kong.     

Equivalence of variational inequality problems to unconstrained minimization

In this paper we propose a class of merit functions for variational inequality problems (VI). Through these merit functions, the variational inequality problem is cast as unconstrained minimization problem. We estimate the growth rate of these merit functions and give conditions under which the stationary points of these functions are the solutions of VI. This work was supported by the state key project “Scientific and Engineering Computing”.     

C^n中子空间之间极端主角的一些应用

本文给出了Ｃ＾ｎ中子空间之间最大和最小主角在矩阵逼近，投影算子的扰动分析，群逆以及Ｏｒａｘｉｎ逆的扰动估计，条件数理论，Ｂｏｔｔ－Ｄｕｆｆｉｎ系统扰动分析中一些应用。